Semantic analysis of concurrent ML by abstract model-checking

Formal Proof of Abstract Model Checking of Concurrent Garbage Collection

Abstract model checking is a method to verify properties of a state transition system by first making abstraction of the system and then applying model checking on the abstract system. If the employed abstraction relation satisfies certain conditions that guarantee the correctness of the abstraction, verification results of the abstract system can be shifted to the original one. However, the co...

A Semantic Theory for Concurrent ML

In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension of the type and effect discipline. In addition to the automatic reconstruction of usual principal types, it computes also the minimal communication effects. The dynamic semantics developed in this paper is denotational...

Abstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection

A Semantic Framework for the Abstract Model Checking

The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate for analyzing timing properties of concurrent systems by model checking. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can still be generated, which may ...

Abstract Semantic Diffing of Evolving Concurrent Programs

Semantic Diffing of Evolving Concurrent Programs Ahmed Bouajjani, Constantin Enea, and Shuvendu Lahiri 1 IRIF, Univ. Paris Diderot, {abou,cenea}@irif.fr 2 Microsoft Research, [email protected] Abstract. We present an approach for comparing two closely related concurrent programs, whose goal is to give feedback about interesting differences without relying on user-provided assertions. This ...